Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative
نویسنده
چکیده
We answer Klop and de Vrijer’s question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a “syntactic” proof that the extensional lambda calculus with surjective pairing is consistent.
منابع مشابه
Combining Rst Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi
It is well known that connuence and strong normalization are preserved when combining left-linear algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that connuence fails when adding either the usual extensional rule for , or recursion together with the usual contraction rule for surjective pairing. We show that connuence and normalization are modular pro...
متن کاملCombining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi
It is well known that connuence and strong normalization are preserved when combining left-linear algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that connuence fails when adding either the usual extensional rule for , or recursion together with the usual contraction rule for surjective pairing. We show that connuence and normalization are modular pro...
متن کاملCombining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints
It is well known that confluence and strong normalization are preserved when combining algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that confluence fails when adding either the usual contraction rule for η, or recursion together with the usual contraction rule for surjective pairing. We show that confluence and strong normalization are modular prop...
متن کاملApplications of Innitary Lambda Calculus
We present an introduction to in nitary lambda calculus, highlighting its main properties. Subsequently we give three applications of in nitary lambda calculus. The rst addresses the non-de nability of Surjective Pairing, which in Barendregt [1984] is shown to be not de nable in lambda calculus. We show how this result follows easily as an application of Berry's Sequentiality Theorem, which its...
متن کاملUnique Normal Forms for Lambda Calculus with Surjective Pairing
We consider the equational theory 3iz of I-calculus extended with constants n, no, =I and axioms for surjective pairing: rr,(nXY) = X, n,(rrXY) = Y, n(n,X)(n,X) = X. Two reduction systems yielding the equality of In are introduced; the first is not confluent and, for the second, confluence is an open problem. It is shown, however, that in both systems each term possessing a normal form has a un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 2 شماره
صفحات -
تاریخ انتشار 2006